Approximating Queues in Slowly Varying Station- Ary Environments
نویسندگان
چکیده
We provide linear approximations to the marginal distributions for a class of infinite-state continuous-time stationary Markov chains in slowly varying environents. We take an approach motivated by light-traffic approximations to stationary point processes, which permits us to consider general stationary environments. Under mild assumptions we show that Jackson networks with routing not affected by the environment, belong to this framework.
منابع مشابه
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input station according to a Poisson process, assuming each order consists of n jobs. Jobs associated with successive orders contend for resources on a FCFS (First Come First Served) dispatching rule in all machines. Upon arrivin...
متن کاملUnification and Application of 3-point Approximating Subdivision Schemes of Varying Arity
In this paper, we propose and analyze a subdivision scheme which unifies 3-point approximating subdivision schemes of any arity in its compact form and has less support, computational cost and error bounds. The usefulness of the scheme is illustrated by considering different examples along with its comparison with the established subdivision schemes. Moreover, B-splines of degree 4and well know...
متن کاملApproximations for the Queue Length Distributions of Time-Varying Many-Server Queues
This paper presents a novel methodology for approximating the queue length (the number of customers in the system) distributions of time-varying non-Markovian manyserver queues (e.g., Gt/Gt/nt queues), where the number of servers (nt) is large. Our methodology consists of two steps. The first step uses phase-type distributions to approximate the general inter-arrival and service times, thus gen...
متن کاملMany - Server Heavy - Traffic Limit for Queues with Time - Varying Parameters
A many-server heavy-traffic FCLT is proved for the Gt/M/st + GI queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment according to a general probability distribution. The FCLT provides theoretical support for the approximating deterministic fluid model the authors analyzed in a previous pape...
متن کاملبهدست آوردن میانگین زمان تکمیلپروژه در شبکههای پرتپویا (سیستم چندپروژهای) با ظرفیت محدود
In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity ...
متن کامل